1767A - Cut the Triangle - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

for _ in range(int(input())):
    MooRsy = input()
    v = []
    u = []
    for _ in range(3):
        a ,b = [int(i) for i in input().split()]
        if a not in v:
            v.append(a)
        if b not in u:
            u.append(b)
    if len(v) == 3 or len(u) == 3:
        print("Yes")
    else:
        print("No")

C++ Code:

#include <bits/stdc++.h>
using    namespace std;
#define  ll  long long 
#define  ulli unsigned ll
#define  ld   long double
#define  pb   push_back
#define  vi   vector<int>
#define  vl   vector<ll>
#define  vc   vector<char>
#define  all(v) v.begin(),v.end()
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ls first
#define rs second
#define FAST ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
const ll M=(ll)(pow(10,9)+7);
int x[4],y[4];
void solve()
{
    FAST;
    for(int i=0;i<3;i++)
    {
        cin>>x[i];
        cin>>y[i];
    }
    if ((x[0]==x[1]||x[1]==x[2]||x[2]==x[0])&&(y[0]==y[1]||y[1]==y[2]|y[2]==y[0])) cout<<"NO\n";
    else cout<<"YES\n";
}
int main()
{
    FAST;
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
}


Comments

Submit
0 Comments
More Questions

479A - Expression
1480A - Yet Another String Game
1216C - White Sheet
1648A - Weird Sum
427A - Police Recruits
535A - Tavas and Nafas
581A - Vasya the Hipster
1537B - Bad Boy
1406B - Maximum Product
507B - Amr and Pins
379A - New Year Candles
1154A - Restoring Three Numbers
750A - New Year and Hurry
705A - Hulk
492B - Vanya and Lanterns
1374C - Move Brackets
1476A - K-divisible Sum
1333A - Little Artem
432D - Prefixes and Suffixes
486A - Calculating Function
1373B - 01 Game
1187A - Stickers and Toys
313B - Ilya and Queries
579A - Raising Bacteria
723A - The New Year Meeting Friends
302A - Eugeny and Array
1638B - Odd Swap Sort
1370C - Number Game
1206B - Make Product Equal One
131A - cAPS lOCK